Optimal Packing Behavior of some 2-block Patterns
نویسنده
چکیده
In this paper, a result of Albert, Atkinson, Handley, Holton, and Stromquist (Proposition 2.4 of [1]) which characterizes the optimal packing behavior of the pattern 1243 is generalized in two directions. The packing densities of layered patterns of type (1, α) and (1, 1, β) are computed. AMS Subject Classifications: 05A15, 05A16
منابع مشابه
Distribution network optimization: Finding the most economic solution by using genetic algorithms
lal Ib~ (c~ Fig. 6. Applying the 4-block heuristics for three-dimensional pallet loading. (a) Layer 1; (b) Layer 2; (c) Layer 3. In this paper the problem of calculating optimal packing patterns of small rectangles on a pallet is considered. We propose new heuristics which are based on the 4-block structure of packing patterns. Since, in general, for practical applications additional restrictio...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملRepeated Patterns of Dense Packings of Equal Disks in a Square
We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2), ...n(k), .... Extending and improving previous work of Nurmela and Österg̊ard [NO] where previous patterns for n = n(k) of the form k, k − 1, k − 3, k(k + 1), and 4k + k were observed, we identify new patterns for n = k − ...
متن کاملProbabilistic Methods Of Searching Local Minimum in Rectangular Bin-Packing Problem Based on its Block Structure
The problem of rectangular objects packing into a semi-endless strip is under consideration. Here we propose to solve this problem by linear cutting approximation that may be presented as block structure of packing. Sometimes it becomes necessary to rearrange elements inside linear cutting blocks. The determined method of “reconstruction”(REC) proposed below helps to get solutions close to opti...
متن کاملSymmetries in Rectangular Block-Packing
The block-packing problem has applications in chip design, factory layout, container shipment optimization, scheduling and other areas. It has been actively studied in the last 20 years, but symmetry in packings has been neglected. Our work deals with symmetry in several formulations of block-packing, including optimization and constraint-satisfaction variants, as well as slicing and non-slicin...
متن کامل